Higher Order Fréchet Derivatives of Matrix Functions and the Level-2 Condition Number

نویسندگان

  • Nicholas J. Higham
  • Samuel D. Relton
چکیده

HIGHER ORDER FRÉCHET DERIVATIVES OF MATRIX FUNCTIONS AND THE LEVEL-2 CONDITION NUMBER∗ NICHOLAS J. HIGHAM† AND SAMUEL D. RELTON† Abstract. The Fréchet derivative Lf of a matrix function f : C n×n → Cn×n controls the sensitivity of the function to small perturbations in the matrix. While much is known about the properties of Lf and how to compute it, little attention has been given to higher order Fréchet derivatives. We derive sufficient conditions for the kth Fréchet derivative to exist and be continuous in its arguments and we develop algorithms for computing the kth derivative and its Kronecker form. We analyze the level-2 absolute condition number of a matrix function (“the condition number of the condition number”) and bound it in terms of the second Fréchet derivative. For normal matrices and the exponential we show that in the 2-norm the level-1 and level-2 absolute condition numbers are equal and that the relative condition numbers are within a small constant factor of each other. We also obtain an exact relationship between the level-1 and level-2 absolute condition numbers for the matrix inverse and arbitrary nonsingular matrices, as well as a weaker connection for Hermitian matrices for a class of functions that includes the logarithm and square root. Finally, the relation between the level-1 and level-2 condition numbers is investigated more generally through numerical experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Block Krylov Method to Compute the Action of the Fréchet Derivative of a Matrix Function on a Vector with Applications to Condition Number Estimation

We design a block Krylov method to compute the action of the Fréchet derivative of a matrix function on a vector using only matrix-vector products, i.e., the derivative of f(A)b when A is subject to a perturbation in the direction E. The algorithm we derive is especially effective when the direction matrix E in the derivative is of low rank, while there are no such restrictions on A. Our result...

متن کامل

An Improved Schur-Padé Algorithm for Fractional Powers of a Matrix and Their Fréchet Derivatives

The Schur–Padé algorithm [N. J. Higham and L. Lin, SIAM J. Matrix Anal. Appl., 32 (2011), pp. 1056–1078] computes arbitrary real powers At of a matrix A ∈ Cn×n using the building blocks of Schur decomposition, matrix square roots, and Padé approximants. We improve the algorithm by basing the underlying error analysis on the quantities ‖(I − A)k‖1/k , for several small k, instead of ‖I−A‖. We ex...

متن کامل

An Introduction to Functional Derivatives

This tutorial on functional derivatives focuses on Fréchet derivatives, a subtopic of functional analysis and of the calculus of variations. The reader is assumed to have experience with real analysis. Definitions and properties are discussed, and examples with functional Bregman divergence illustrate how to work with the Fréchet derivative. 1 Functional Derivatives Generalize the Vector Gradie...

متن کامل

Estimating the Condition Number of the Fréchet Derivative of a Matrix Function

ESTIMATING THE CONDITION NUMBER OF THE FRÉCHET DERIVATIVE OF A MATRIX FUNCTION∗ NICHOLAS J. HIGHAM† AND SAMUEL D. RELTON† Abstract. The Fréchet derivative Lf of a matrix function f : C n×n → Cn×n is used in a variety of applications and several algorithms are available for computing it. We define a condition number for the Fréchet derivative and derive upper and lower bounds for it that differ ...

متن کامل

Computing the Fréchet Derivative of the Matrix Exponential, with an Application to Condition Number Estimation

The matrix exponential is a much-studied matrix function having many applications. The Fréchet derivative of the matrix exponential describes the first-order sensitivity of eA to perturbations in A and its norm determines a condition number for eA. Among the numerous methods for computing eA the scaling and squaring method is the most widely used. We show that the implementation of the method i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2014